منابع مشابه
A Graph-Theoretic Approach to a Partial Order of Knots and Links
We say that a link L1 is an s-major of a link L2 if any diagram of L1 can be transformed into a diagram of L2 by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime alternating links. We determine this partial order for all prime alternating knots and links with the crossing number less than or equal to six. The proofs are given by g...
متن کاملPartial second-order subdifferentials of -prox-regular functions
Although prox-regular functions in general are nonconvex, they possess properties that one would expect to find in convex or lowerC2 functions. The class of prox-regular functions covers all convex functions, lower C2 functions and strongly amenable functions. At first, these functions have been identified in finite dimension using proximal subdifferential. Then, the definition of prox-regula...
متن کاملPartial Order
Ginsberg has recently introduced a polynomial space aggressive dependency directed backtrack search technique. Aggressive dependency directed techniques have the property that the size of the search space generated by a union of disjoint subproblems is proportional to the sum of the search space generated by each problem independently. Earlier polynomial space dependency directed methods did no...
متن کاملPartitioning a weighted partial order
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not only assume that the chains have bounded size, but also that a weight wi is given for each element i in the partial order such that wi ≤ wj if i ≺ j. The problem is then to partition the partial order into a minimum-we...
متن کاملA Geometric View of Partial Order Reduction
Verifying that a concurrent program satisfies a given property, such as deadlock-freeness, is computationally difficult. Naive exploration techniques are facing the state space explosion problem: they consider an exponential number of interleavings of parallel threads (relative to the program size). Partial order reduction is a standard method to address this difficulty. It is based on the obse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tokyo Journal of Mathematics
سال: 1989
ISSN: 0387-3870
DOI: 10.3836/tjm/1270133192